Higher-Order Leak and Deadlock Free Locks

Reasoning about concurrent programs is challenging, especially if data shared among threads. Program correctness can be violated by the presence of races—whose prevention has been a topic concern both in research and practice. The Rust programming language prime example, putting slogan fearless concurrency practice not only employing an ownership-based type system for memory management, but also using its to enforce mutual exclusion on data. Locking, unfortunately, comes at price deadlocks access may cause leaks . This paper develops theory deadlock leak freedom higher-order locks setting. Higher-order allow sharing basic values other channels, are themselves first-class citizens. based notion topology , administrating who permitted what point program. first acyclic topologies, instantiated λ-calculus with message-passing concurrency. then extends calculus support circular dependencies dynamic lock orders, which we illustrate version Dijkstra’s dining philosophers problem. Well-typed resulting calculi shown free leaks, proofs mechanized Coq proof assistant.